A dynamically extending exclusion process
نویسندگان
چکیده
منابع مشابه
Totally Asymmetric Exclusion Process
The algebraic structure underlying the totally asymmetric exclusion process is studied by using the Bethe Ansatz. From the properties of the algebra generated by the local jump operators, we construct explicitly the hierarchy of operators that commute with the Markov operator. The transfer matrix, which is the generating function of these operators, is shown to represent a discrete Markov proce...
متن کاملHematopoiesis as a Competitive Exclusion Process
Female Safari cats are offspring of domestic and Geoffroy parents, and are balanced helcer,oz,rgc,tes with equal numbers of blood cells containing domestic as Geoffroy-type glucose 6-phosphate dehydrogenase (G6PD), an X-chromosome derived enzyme. In previous studies, however, we observed increasing percentages of blood cells with Geoffroy G6PD over 4-12 years. Similarly, ratios of parental X-ch...
متن کاملTotally asymmetric simple exclusion process
Unlike equilibrium statistical mechanics non-equilibrium statistical mechanics (NESM) has no wellestablished framework. The totally asymmetric simple exclusion process (TASEP) is one of the few models available that try to meet the challenge of describing NESM. Here TASEP is presented in its simplest version. Further two biological applications on mRNA translation and molecular motors are prese...
متن کاملExtending Distributed Mutual Exclusion Algorithms to Support Multithreading
Traditional distributed mutual exclusion algorithms fail to support multithreaded environments. In such systems, a single node could have several pending requests, each issued by a different thread. In this paper we present extensions to five distributed mutual exclusion algorithms. These extensions were developed by exploiting some common characteristics shared by the algorithms. Our approach ...
متن کاملProcess Interconnection Structures in Dynamically Changing Topologies
This paper presents a mechanism that organizes processes in the hierarchy and efficiently maintains it in the presence of addition/removal of nodes to the system, and in the presence of node failures. This mechanism can support total order of broadcasts and does not rely on any specific system features or special hardware. In addition, it can concurrently support multiple logical structures, su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2007
ISSN: 1742-5468
DOI: 10.1088/1742-5468/2007/11/p11013